Biased Random-Walk Learning: A Neurobiological Correlate to Trial-and-Error
نویسنده
چکیده
Neural network models offer a theoretical testbed for the study of learning at the cellular level. The only experimentally verified learning rule, Hebb’s rule, is extremely limited in its ability to train networks to perform complex tasks. An identified cellular mechanism responsible for Hebbian-type long-term potentiation, the NMDA receptor, is highly versatile. Its function and efficacy are modulated by a wide variety of compounds and conditions and are likely to be directed by non-local phenomena. Furthermore, it has been demonstrated that NMDA receptors are not essential for some types of learning. We have shown that another neural network learning rule, the chemotaxis algorithm, is theoretically much more powerful than Hebb’s rule and is consistent with experimental data. A biased random-walk in synaptic weight space is a learning rule immanent in nervous activity and may account for some types of learning – notably the acquisition of skilled movement.
منابع مشابه
Einstein relation for biased random walk on Galton–Watson trees
We prove the Einstein relation, relating the velocity under a small perturbation to the diffusivity in equilibrium, for certain biased random walks on Galton–Watson trees. This provides the first example where the Einstein relation is proved for motion in random media with arbitrary deep traps.
متن کاملThe cover time of a biased random walk on Gn, p
We analyze the covertime of a biased random walk on the random graph Gn,p. The walk is biased towards visiting vertices of low degree and this makes the covertime less than in the unbiased case.
متن کاملLine crossing problem for biased monotonic random walks in the plane
In this paper, we study the problem of finding the probability that the two-dimensional (biased) monotonic random walk crosses the line y = αx+d, where α, d ≥ 0. A β-biased monotonic random walk moves from (a, b) to (a + 1, b) or (a, b + 1) with probabilities 1/(β + 1) and β/(β + 1), respectively. Among our results, we show that if β ≥ ⌈α⌉, then the β-biased monotonic random walk, starting from...
متن کاملThe speed of biased random walk on percolation clusters
We consider biased random walk on supercritical percolation clusters in Z. We show that the random walk is transient and that there are two speed regimes: If the bias is large enough, the random walk has speed zero, while if the bias is small enough, the speed of the random walk is positive.
متن کاملRandom Walk on Periodic Treeschristiane Takacs
Following Lyons (1990, 4]) we deene a periodic tree, restate its branching number and consider a biased random walk on it. In the case of a transient walk, we describe the walk-invariant random periodic tree and calculate the asymptotic rate of escape (speed) of the walk. This is achieved by exploiting the connections between random walks and electric networks. 1. Introduction This paper deals ...
متن کامل